Domain Decomposition Methods for Variational Inequalities
نویسنده
چکیده
Variational inequalities have found many applications in applied science. A partial list includes obstacles problems, fluid flow in porous media, management science, traffic network, and financial equilibrium problems. However, solving variational inequalities remain a challenging task as they are often subject to some set of complex constraints, for example the obstacle problem. Domain decomposition methods provide great flexibility to handle these types of problems. In our thesis we consider a general variational inequality, its finite element formulation and its equivalence with linear and quadratic programming. We will then present a non-overlapping domain decomposition formulation for variational inequalities. In our formulation, the original problem is reformulated into two subproblems such that the first problem is a variational inequality in subdomain Ω and the other is a variational equality in the complementary subdomain Ω. This new formulation will reduce the computational cost as the variational inequality is solved on a smaller region. However one of the main challenges here is to obtain the global solution of the problem, which is to be coupled through an interface problem. Finally, we validate our method on a two dimensional obstacle problem using quadratic programming. Some part of this thesis has been accepted to publish in proceeding from the twenty first international conference on domain decomposition methods [94].
منابع مشابه
An additive Schwarz method for variational inequalities
This paper proposes an additive Schwarz method for variational inequalities and their approximations by finite element methods. The Schwarz domain decomposition method is proved to converge with a geometric rate depending on the decomposition of the domain. The result is based on an abstract framework of convergence analysis established for general variational inequalities in Hilbert spaces.
متن کاملUN CO RR EC TE D PR O O F 1 Domain Decomposition Methods for Auxiliary Linear 2 Problems of an Elliptic Variational Inequality 3
Elliptic variational inequalities with multiple bodies are considered. It is assumed 7 that an active set method is used to handle the nonlinearity of the inequality constraint, which 8 results in auxiliary linear problems. We describe two domain decomposition methods for solv9 ing such linear problems, namely, the FETI-FETI (finite element tearing and interconnecting) 10 and hybrid methods, wh...
متن کاملProjector preconditioning for partially bound-constrained quadratic optimization
Preconditioning by a conjugate projector is combined with the recently proposed MPRGP algorithm for the solution of bound constrained quadratic programming problems. If applied to the partially bound constrained problems, such as those arising from the application of FETI based domain decomposition methods to the discretized elliptic boundary variational inequalities, the resulting algorithm is...
متن کاملConvergence Rate Analysis of a Multiplicative Schwarz Method for Variational Inequalities
This paper derives a linear convergence for the Schwarz overlapping domain decomposition method when applied to constrained minimization problems. The convergence analysis is based on a minimization approach to the corresponding functional over a convex set. A general framework of convergence is established for some multiplicative Schwarz algorithm. The abstract theory is particularly applied t...
متن کامل